Local Shannon entropy measure with statistical tests for image randomness

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Shannon entropy measure with statistical tests for image randomness

Article history: Received 24 March 2011 Received in revised form 25 July 2012 Accepted 30 July 2012 Available online 7 August 2012

متن کامل

Shannon entropy as a new measure of aromaticity, Shannon aromaticity.

Based on the local Shannon entropy concept in information theory, a new measure of aromaticity is introduced. This index, which describes the probability of electronic charge distribution between atoms in a given ring, is called Shannon aromaticity (SA). Using B3LYP method and different basis sets (6-31G**, 6-31+G** and 6-311++G**), the SA values of some five-membered heterocycles, C(4)H(4)X, a...

متن کامل

Deng entropy: a generalized Shannon entropy to measure uncertainty

Shannnon entropy is an efficient tool to measure uncertain information. However, it cannot handle the more uncertain situation when the uncertainty is represented by basic probability assignment (BPA), instead of probability distribution, under the framework of Dempster Shafer evidence theory. To address this issue, a new entropy, named as Deng entropy, is proposed. The proposed Deng entropy is...

متن کامل

Shannon and Non Shannon Entropy Based MRI Image Segmentation

Image Segmentation plays an important role in medical field that enable professionals to detect their patient’s problems and help them to get proper diagnosed. In this article, an entropy based approach for image segmentation is discussed to highlight tumor in MRI images. Magnetic Resonance Imaging (MRI) is an imaging, in which pixel values are based on radiation absorption. In the proposed app...

متن کامل

The Boltzmann Entropy and Randomness Tests

In the context of the dynamical systems of classical mechanics, we introduce two new notions called “algorithmic fine-grain and coarse-grain entropy”. The fine-grain algorithmic entropy is, on the one hand, a simple variant of the randomness tests of MartinLöf (and others) and is, on the other hand, a connecting link between description (Kolmogorov) complexity, Gibbs entropy and Boltzmann entro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Sciences

سال: 2013

ISSN: 0020-0255

DOI: 10.1016/j.ins.2012.07.049